A Tractable Variant of Cover Time
نویسنده
چکیده
We introduce a variant of the cover time of a graph, called cover cost, in which the cost of a step is proportional to the number of yet uncovered vertices. It turns out that cover cost is more tractable than cover time; we provide an O(n) algorithm for its computation, as well as some explicit formulae. The two values are not very far from each other, and so cover cost might be a useful tool in the study of cover time.
منابع مشابه
Exact Algorithms for Generalizations of Vertex Cover
The NP-complete Vertex Cover problem has been intensively studied in the field of parameterized complexity theory. However, there exists only little work concerning important generalizations of Vertex Cover like Partial Vertex Cover, Connected Vertex Cover, and Capacitated Vertex Cover which are of high interest in theory as well as in real-world applications. So far research was mainly focused...
متن کاملOn the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
Maximum Common Induced Subgraph (henceforth MCIS) is among the most studied classical NP-hard problems. MCIS remains NP-hard on many graph classes including bipartite graphs, planar graphs and k-trees. Little is known, however, about the parameterized complexity of the problem. When parameterized by the vertex cover number of the input graphs, the problem was recently shown to be fixed-paramete...
متن کاملMinimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity
We perform a systematic study in the computational complexity of the connected variant of three related transversal problems: Vertex Cover, Feedback Vertex Set, and Odd Cycle Transversal. Just like their original counterparts, these variants are NP-complete for general graphs. A graph G is H-free for some graph H if G contains no induced subgraph isomorphic to H . It is known that Connected Ver...
متن کاملParameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters
Let G be a graph such that each vertex has its list of available colors, and assume that each list is a subset of the common set consisting of k colors. For two given list colorings of G, we study the problem of transforming one into the other by changing only one vertex color assignment at a time, while at all times maintaining a list coloring. This problem is known to be PSPACE-complete even ...
متن کاملImprovement on vertex cover for low-degree graphs
The Vertex Cover problem (given a graph G and an integer k, decide if G has a vertex cover of k vertices) is one of the six “basic” NP-complete problems according to Garey and Johnson [7]. It is fixed-parameter tractable in terms of Downey and Fellows [5], that is, it can be solved in time O(f(k)n), where f is a function of the parameter k but independent of the input length n and c is a consta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1206.6605 شماره
صفحات -
تاریخ انتشار 2012